On Playing "Twenty Questions" with a Liar
نویسندگان
چکیده
We consider a version of the game “Twenty Questions” played on the set {0, · · · ,N − 1} where the player giving answersmay lie in her answers. The questioner is allowedQ questions and the responder may lie in up to rQ of the answers, for some fixed and previously known fraction r. Under various models of this game and different question classes, we give precise conditions (i.e. tight bounds on r and, in most cases, optimal bounds on Q) under which the questioner has a winning strategy in the game. ∗Author was supported by DARPA Contract N00014-87-K-825, National Science Foundation Grant CCR-8912586, and Air Force Contract AFOSR-89-0271. Author’s net address: [email protected] †Supported in part by NSF Grant CCR-9002614. Author’s net address: [email protected] ‡Author is on leave from Emory University; research at Emory supported by ONR grant N00014 85-K-0769. Author’s net address: [email protected]
منابع مشابه
The Two-Batch Liar Game over an Arbitrary Channel
We consider liar games in which player Paul must ask one full batch of questions, receive all answers, and then ask a second and final batch of questions. We show that the effect of this restriction is asymptotically negligible. The strategy for Paul is given explicitly.
متن کاملThe Liar in Context
About twenty-five years ago, Charles Parsons published a paper that began by asking why we still discuss the Liar Paradox. Today, the question seems all the more apt. In the ensuing years we have seen not only Parsons’ work (1974), but seminal work of Saul Kripke (1975), and a huge number of other important papers. Too many to list. Surely, one of them must have solved it! In a way, most of the...
متن کاملLiar Buyer Fraud, and How to Curb It
We describe a common but poorly known type of fraud – so-called liar buyer fraud – and explain why traditional anti-fraud technology has failed to curb this problem. We then introduce a counter-intuitive technique based on user interface modification to address liar-buyer fraud, and report result of experiments supporting that our technique has the potential of dramatically reducing fraud losse...
متن کاملTwenty (or so) Questions: Bounded-Length Huffman Coding
The game of Twenty Questions has long been used to illustrate binary source coding. Recently, a physical device has been developed which mimics the process of playing Twenty Questions, with the device supplying the questions and the user providing the answers. However, this game differs from Twenty Questions in two ways: Answers need not be only “yes” and “no,” and the device continues to ask q...
متن کامل